منابع مشابه
Counting Gene Finding Functions
In biology, a gene-finding function is one which takes a DNA sequence and returns the most likely underlying intron/exon structure. Generalizing to graphical models, maps from observed states to their most probable hidden state are called inference functions. While the problem of counting inference functions for a given model is not easy, it has been shown that the number of inference functions...
متن کاملCounting Defective Parking Functions
Suppose that m drivers each choose a preferred parking space in a linear car park with n spaces. Each driver goes to the chosen space and parks there if it is free, and otherwise takes the first available space with a larger number (if any). If all drivers park successfully, the sequence of choices is called a parking function. In general, if k drivers fail to park, we have a defective parking ...
متن کاملCounting Homomorphisms and Partition Functions
Homomorphisms between relational structures are not only fundamental mathematical objects, but are also of great importance in an applied computational context. Indeed, constraint satisfaction problems, a wide class of algorithmic problems that occur in many different areas of computer science such as artificial intelligence or database theory, may be viewed as asking for homomorphisms between ...
متن کاملCounting with rational generating functions
We examine two different ways of encoding a counting function, as a rational generating function and explicitly as a function (defined piecewise using the greatest integer function). We prove that, if the degree and number of input variables of the (quasi-polynomial) function are fixed, there is a polynomial time algorithm which converts between the two representations. Examples of such countin...
متن کاملAlgorithms counting monotone Boolean functions
We give a new algorithm counting monotone Boolean functions of n variables (or equivalently the elements of free distributive lattices of n generators). We computed the number of monotone functions of 8 variables which is 56 130 437 228 687 557 907 788. 2001 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1992
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093634488